Context-dependent Agents for Real-time Scheduling in Manufacturing Systems
نویسندگان
چکیده
Autonomous distributed manufacturing systems(ADMS) consist of multiple intelligent components with each component acting according to its own judgments. The ADMS objective is to realize more agile and adaptive manufacturing systems. This paper presents the introduction of context-dependent agents (CDAs) in ADMS that switch strategies depending on system conditions to achieve better performance than can be realized by agents that use the same strategies under all system conditions. For the real-time job scheduling problem, the paper presents a basic CDA architecture and the results of an extensive empirical evaluation its performance relative to other rule-based schemes based on several common indices for real-time dispatch.
منابع مشابه
Part-level Sequence Dependent Setup Time Reduction in CMS
This paper presents the idea of creating cells while reducing part-level sequence-dependent setup time in general cellular manufacturing systems (CMS). Setup time reduction in CMS has gained modest attention in the literature. This could be attributed to the fact that the fundamental problem in cell formation in CMS has been mainly related to material handling and machine utilization while setu...
متن کاملReal-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm
The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...
متن کاملVirtual manufacturing cells scheduling considering lotstreaming and sequence dependent setup times
In this paper, a new mathematical model for the problem of job scheduling in virtual manufacturing cells (VMC) is presented to minimizing the completion time of all jobs. Sequence dependent setup times of machines is considered and lot-streaming is possible. In Virtual manufacturing cells, each job has a different processing path and there is a set of machines for processing each operation. The...
متن کاملMathematical Modeling for a Flexible Manufacturing Scheduling Problem in an Intelligent Transportation System
This paper presents a new mathematical model for a production system through a scheduling problem considering a material handling system as an intelligent transportation system by automated guided vehicles (AGVs). The traditional systems cannot respond to the changes and customer’s demands and for this reason, a flexible production system is used. Therefore, for this purpose, automated transpor...
متن کاملMinimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times
The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...
متن کامل